Towards Guided Trajectory Explorationof Graph Transformation SystemsThis work was partially supported by the SecureChange (ICT-FET-231101) project and the Janos Bolyai Scholarship
نویسندگان
چکیده
Graph transformation systems (GTS) are often used for modeling the behavior of complex systems. A common GTS analysis scenario is the exploration of its state space from an initial state to a state adhering to given goals through a proper trajectory. Guided trajectory exploration uses information from some more abstract analysis of the system as hints to reduce the traversed state space. These hints are used to order possible further transitions from a given state (selection) and detect violations early (cut-off), thus pruning unpromising trajectories from the state space. In the current paper, we define cut-off and selection criteria for guiding the trajectory exploration, and use Petri Net analysis results and the dependency relations between rules as hints in our criteria calculation algorithm. The criteria definitions include navigation along dependency relations, various types of ordering for selection and quantifiers for cut-off criteria. Our approach is exemplified on a cloud infrastructure configuration problem.
منابع مشابه
Program Understanding case study solution using the Viatra2 framework
The current paper presents a solution of the Model Transformations for Program Understanding: A Reengineering Challenge case study of the Transformation Tool Contest 2011, using the Viatra2 model transformation tool. This work was partially supported by ICT FP7 SecureChange (ICT-FET-231101) European Project.
متن کاملOmega and PIv Polynomial in Dyck Graph-like Z(8)-Unit Networks
Design of crystal-like lattices can be achieved by using some net operations. Hypothetical networks, thus obtained, can be characterized in their topology by various counting polynomials and topological indices derived from them. The networks herein presented are related to the Dyck graph and described in terms of Omega polynomial and PIv polynomials.
متن کاملSearch for the end of a path in the d-dimensional grid and in other graphs
We consider the worst-case query complexity of some variants of certain PPAD-complete search problems. Suppose we are given a graph G and a vertex s ∈ V (G). We denote the directed graph obtained from G by directing all edges in both directions by G′. D is a directed subgraph of G′ which is unknown to us, except that it consists of vertex-disjoint directed paths and cycles and one of the paths ...
متن کاملCircular choosability
We study circular choosability, a notion recently introduced by Mohar and by Zhu. First, we provide a negative answer to a question of Zhu about circular cliques. We next prove that cch(G) = O (ch(G) + ln |V (G)|) for every graph G. We investigate a generalisation of circular choosability, the circular f -choosability, where f is a function of the degrees. We also consider the circular choice n...
متن کاملVerifying a Behavioural Logic for Graph Transformation Systems
We propose a framework for the verification of behavioural properties of systems modelled as graph transformation systems. The properties can be expressed in a temporal logic which is basically a μ-calculus where the state predicates are formulae of a monadic second order logic, describing graph properties. The verification technique relies on an algorithm for the construction of finite over-ap...
متن کامل